Triangles with Integer Sides, Revisited
نویسندگان
چکیده
منابع مشابه
Integer Triangles with R / r = N Allan
We consider the problem of finding integer-sided triangles with R/r an integer, where R and r are the radii of the circumcircle and incircle respectively. We find that such triangles are relatively rare.
متن کاملBroken Triangles Revisited
A broken triangle is a pattern of (in)compatibilities between assignments in a binary CSP (constraint satisfaction problem). In the absence of certain broken triangles, satisfiability-preserving domain reductions are possible via merging of domain values. We investigate the possibility of maximising the number of domain reduction operations by the choice of the order in which they are applied, ...
متن کاملPrimitive Heronian Triangles With Integer Inradius and Exradii
It is well known that primitive Pythagorean triangles have integer inradius and exradii. We investigate the generalization to primitive Heronian triangles. In particular, we study the special cases of isosceles triangles and triangles with sides in arithmetic progression. We also give two families of primitive Heronian triangles, one decomposable and one indecomposable, which have integer inrad...
متن کاملTwo-stage quadratic integer programs with stochastic right-hand sides
We consider two-stage quadratic integer programs with stochastic right-hand sides, and present an equivalent reformulation using value functions. We first derive some basic properties of value functions of quadratic integer programs. We then propose a two-phase solution approach. The first phase constructs the value functions of quadratic integer programs in both stages. The second phase solves...
متن کاملApproximating integer programs with positive right-hand sides
1 Department of Computer and Information S ien e, Linköpings universitet, SE-581 83 Linköping, Sweden 2 É ole polyte hnique, Laboratoire d'informatique (LIX), 91128 Palaiseau Cedex, Fran e Abstra t. We study minimisation of integer linear programs with positive right-hand sides. We show that su h programs an be approximated within the maximum absolute row sum of the onstraint matrix A whenever ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics Magazine
سال: 2000
ISSN: 0025-570X,1930-0980
DOI: 10.1080/0025570x.2000.11996802